Adaptive weight grey wolf algorithm application on path planning in unknown environments

نویسندگان

چکیده

Autonomous mobile robots developed using metaheuristic algorithms are increasingly becoming a hot topic in control and computer sciences. Specifically, finding the shortest route to goal avoiding hurdles current subjects of autonomous robots. The Modified Grey Wolf Optimization (MGWO) is demonstrated this work two approaches: first, Adaptive Adjustment Approach Control Parameters, second, Variable Weights method. Those methods utilized for updating wolf position, accelerate convergence, cut down on time. proposed online optimization approach used three different environments including an environment with unknown static obstacles, dynamic target. method performed phases which sensors reading phase path calculation phase. can solve local minima problem obstacles. A comparison study result between other revealed that algorithm better include situation minima. Finally, when put Hybrid Fuzzy-Wind Driven Particle Swarm average improvement rates length 2.86% 4.70391%, respectively.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Path-Planning Algorithm for Multiple Robots in Unknown Environments

This paper describes a new method of path planning for multiple robots in unknown environments. The method, called Space D*, is based on two algorithms: the D*, which is an incremental graph search algorithm, and the Space Colonization algorithm, previously used to simulate crowd behaviors. The path planning is achieved through the exchange of information between the robots. So decentralized, e...

متن کامل

On-line safe path planning in unknown environments

s For the on-line safe path planning of a mobile robot in unknown environments, the paper proposes a simple Hopfield Neural Network ( HNN ) planner. Without learning process, the HNN plans a safe path with consideration of “ too close” or “ too far” . For obstacles of arbitrary shape, we prove that the HNN has no unexpected local attractive point and can find a steepest climbing path, if a feas...

متن کامل

Covert Robotics: Covert Path Planning in Unknown Environments

1 Introduction Covert Robotics is an interesting research problem which we have presented earlier in [Marzouqi and Jarvis, 2003; Marzouqi and Jarvis, 2004]. The aim of the research is to create autonomous mobile robots with the ability to accomplish different types of navigation missions covertly, i.e. without being observed by one or more, possibly hostile, sentries operating within the same e...

متن کامل

Intelligent Path Planning in Unknown Environments with Vision-like Sensors

In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment non-locally. Examples would include a mobile robot exploring an unknown terrain or a micro-UAV navigating in a cluttered urban environment. We show that the problem of path planning in an uncertain environment, under c...

متن کامل

Path planning and navigation of mobile robots in unknown environments

For a robot trying to reach places in at least partially unknown environments there is often a need to replan paths online based on information extracted from the surroundings. In this paper is is assumed that the sensing range of the robot is short compared to the length of the paths it plans and the environment is modeled as a graph consisting of nodes and arcs. The replanning problem is solv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science

سال: 2022

ISSN: ['2502-4752', '2502-4760']

DOI: https://doi.org/10.11591/ijeecs.v27.i3.pp1375-1387